Synchronizing groups and automata
نویسندگان
چکیده
منابع مشابه
Synchronizing groups and automata
Pin showed that every p-state automaton (p a prime) containing a cyclic permutation and a non-permutation has a synchronizing word of length at most (p− 1). In this paper we consider permutation automata with the property that adding any non-permutation will lead to a synchronizing word and establish bounds on the lengths of such synchronizing words. In particular, we show that permutation grou...
متن کاملGroups and Semigroups Defined by Colorings of Synchronizing Automata
In this paper we combine the algebraic properties of Mealy machines generating self-similar groups and the combinatorial properties of the corresponding deterministic finite automata (DFA). In particular, we relate bounded automata to finitely generated synchronizing automata and characterize finite automata groups in terms of nilpotency of the corresponding DFA. Moreover, we present a decidabl...
متن کاملExperiments with Synchronizing Automata
We have improved an algorithm generating synchronizing automata with a large length of the shortest reset words. This has been done by refining some known results concerning bounds on the reset length. Our improvements make possible to consider a number of conjectures and open questions concerning synchronizing automata, checking them for automata with a small number of states and discussing th...
متن کاملSynchronizing weighted automata
We introduce two generalizations of synchronizability to automata with transitions weighted in an arbitrary semiring K = (K,+, ·,0,1). For states p,q and word u, let (pu)q ∈ K denote the sum of the weights of all u-labeled paths from p to q, with the weigth of a path being the product of the weights of its edges, as usual. We call the automaton A location-synchronizable if ∃q,u: ∀p,r (pu)r 6= 0...
متن کاملSlowly Synchronizing Automata and Digraphs
We present several infinite series of synchronizing automata for which the minimum length of reset words is close to the square of the number of states. These automata are closely related to primitive digraphs with large exponent. 1 Background and overview A complete deterministic finite automaton (DFA) is a triple A = 〈Q,Σ, δ〉, where Q and Σ are finite sets called the state set and the input a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2006
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2006.02.003